A note on deterministic zombies

A Note on a Decomposition Theorem for Simple Deterministic Languages

The simple deterministic grammar (s-grammar) is the standard form grammar in which the handles of the Z-rules are distinct for each nonterminal symbol Z. The language generated by an s-grammar is called the simple deterministic language (s-language). It is known that the s-languages have the the prefix property and that their equivalence problem is solvable. (Korenjak and Hopcroft, 1966). Using...

A Note on the Succinctness of Descriptions of Deterministic Languages

The result proved in this paper is that for the elements of some infinite class of deterministic context-free languages the size of deterministic pushdown amomata needed to describe them is not recursively bounded by the size of the smallest unambiguous context-free grammars that generate them. This is a quantitative explanation of the fact that some languages require large descriptions in term...

A Note on Fault Attacks Against Deterministic Signature Schemes

A note on the complexity of deterministic tree-walking transducers

The deterministic tree-walking transducer is one of a number of possible formalisms for defining mildly context-sensitive languages. It is well known that the non-uniform membership problem for languages that can be defined in this formalism is solvable in polynomial time. The uniform membership problem, where both the transducer and the word in question are considered part of the input, is les...

A note on controllability of deterministic context-free systems

In this paper, we prove that the most important concept of supervisory control of discrete-event systems, the controllability property, is undecidable for two deterministic context-free languages K and L, where L is prefix-closed, even though K is a subset of L. If K is not a subset of L, the undecidability follows from the work by Sreenivas. However, the case where K is a subset of L does not ...